Scientific data interpolation with low dimensional manifold model
نویسندگان
چکیده
منابع مشابه
Low Dimensional Manifold Model for Image Processing
Abstract. In this paper, we propose a novel low dimensional manifold model (LDMM) and apply it to some image processing problems. LDMM is based on the fact that the patch manifolds of many natural images have low dimensional structure. Based on this fact, the dimension of the patch manifold is used as a regularization to recover the image. The key step in LDMM is to solve a Laplace-Beltrami equ...
متن کاملLow Dimensional Manifold Model with Semi-local Patches
Abstract. In this paper we integrate semi-local patches and the weighted graph Laplacian [17] into the framework of the low dimensional manifold model [12]. This approach is much faster than the original LDMM algorithm. The number of iterations is typically reduced from 100 to 10 and the equations in each step are much easier to solve. This new approach is tested in image inpainting and denoisi...
متن کاملSurvival of Dialysis Patients Using Random Survival Forest Model in Low-Dimensional Data with Few-Events
Background:Dialysis is a process for eliminating extra uremic fluids of patients with chronic renal failure. The present study aimed to determine the variables that influence the survival of dialysis patients using random survival forest model (RSFM) in low-dimensional data with low events per variable (EPV). Methods:In this historical cohort study, infor...
متن کاملLow dimensional manifold model in hyperspectral image reconstruction
We present the application of a low dimensional manifold model (LDMM) on hyperspectral image (HSI) reconstruction. An important property of hyperspectral images is that the patch manifold, which is sampled by the three-dimensional blocks in the data cube, is generally of a low dimensional nature. This is a generalization of low-rank models in that hyperspectral images with nonlinear mixing term...
متن کاملLDMNet: Low Dimensional Manifold Regularized Neural Networks
Deep neural networks have proved very successful on archetypal tasks for which large training sets are available, but when the training data are scarce, their performance suffers from overfitting. Many existing methods of reducing overfitting are data-independent, and their efficacy is often limited when the training set is very small. Data-dependent regularizations are mostly motivated by the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2018
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2017.09.048